منابع مشابه
Proofs of Randomized Algorithms in Coq
Randomized algorithms are widely used for finding efficiently approximated solutions to complex problems, for instance primality testing and for obtaining good average behavior. Proving properties of such algorithms requires subtle reasoning both on algorithmic and probabilistic aspects of programs. Thus, providing tools for the mechanization of reasoning is an important issue. This paper prese...
متن کاملA library for reasoning on randomized algorithms in Coq
This library forms a basis for reasoning on randomised algorithms in the proof assistant Coq [6]. The source les are available from the author homepage (http://www.lri.fr/ paulin). They can be compiled using Coq version V8.2pl1. The theoretical basis of this work is a joint work with Philippe Audebaud and is described in [1, 2]. It is developed in the framework of the project SCALP : ANR-07-SES...
متن کاملAlea: a library for reasoning on randomized algorithms in Coq
1 Misc.v: Preliminaries 5 1.1 De nition of iterator compn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.2 Reducing if constructs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.3 Classical reasoning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.4 Extensional equality . . . ....
متن کاملCoqatoo: Generating Natural Language Versions of Coq Proofs
Due to their numerous advantages, formal proofs and proof assistants, such as Coq, are becoming increasingly popular. However, one disadvantage of using proof assistants is that the resulting proofs can sometimes be hard to read and understand, particularly for less-experienced users. To address this issue, we have implemented a tool capable of generating natural language versions of Coq proofs...
متن کاملModular SMT Proofs for Fast Reflexive Checking Inside Coq
We present a new methodology for exchanging unsatisfiability proofs between an untrusted SMT solver and a sceptical proof assistant with computation capabilities like Coq. We advocate modular SMT proofs that separate boolean reasoning and theory reasoning; and structure the communication between theories using Nelson-Oppen combination scheme. We present the design and implementation of a Coq re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2009
ISSN: 0167-6423
DOI: 10.1016/j.scico.2007.09.002